Distribution of Edge Load in Scale-free Trees
نویسندگان
چکیده
Node betweenness has been studied recently by a number of authors, but until now less attention has been paid to edge betweenness. In this paper, we present an exact analytic study of edge betweenness in evolving scale-free and non-scale-free trees. We aim at the probability distribution of edge betweenness under the condition that a local property, the in-degree of the "younger" node of a randomly selected edge, is known. En route to the conditional distribution of edge betweenness the exact joint distribution of cluster size and in-degree, and its one-dimensional marginal distributions have been presented in the paper as well. From the derived probability distributions the expectation values of different quantities have been calculated. Our results provide an exact solution not only for infinite, but for finite networks as well.
منابع مشابه
Determination The Stress Intensity Factor in The Un-Central Edge Cracks With The concentrated Load
The stress distribution on the tip of the cracks and the stress intensity factor on them are the main courses in the fracture mechanic. The stress intensity factor of the cracks with the different load exited and the different geometry are listed in the tables of the standard books. In all of them, the cracks are located in the central point of the plates. In the uniform edge loaded case, the c...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملScale-free trees: the skeletons of complex networks.
We investigate the properties of the spanning trees of various real-world and model networks. The spanning tree representing the communication kernel of the original network is determined by maximizing the total weight of the edges, whose weights are given by the edge betweenness centralities. We find that a scale-free tree and shortcuts organize a complex network. Especially, in ubiquitous sca...
متن کامل2 3 D ec 2 00 7 Descents and nodal load in scale - free networks
The load of a node in a network is the total traffic going through it when every node pair sustains a uniform bidirectional traffic between them on shortest paths. We show that nodal load can be expressed in terms of the more elementary notion of a node’s descents in breadth-first-search (BFS or shortest-path) trees, and study both the descent and nodal-load distributions in the case of scale-f...
متن کاملDescents and nodal load in scale-free networks.
The load of a node in a network is the total traffic going through it when every node pair sustains a uniform bidirectional traffic between them on shortest paths. We express nodal load in terms of the more elementary notion of a node's descents in breadth-first-search [(BFS) or shortest-path] trees and study both the descent and nodal-load distributions in the case of scale-free networks. Our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 73 4 Pt 2 شماره
صفحات -
تاریخ انتشار 2006